Millimeter wave beams diffracted from reflecting gratings

According to the angular-spectrum method, a radiation beam of an antenna horn in the Fresnal region is decomposed into the plane waves with the fast Fourier transform algorithm and the waves diffracted from a reflection grating are superposed as a diffracted beam. Compared with the reflected beam from the same size mirror, the radiation half width of the diffracted beam from a grating is narrower and its lateral shape is shift. These performances have been experimentally verified at Ka-band by: (1). The relative diffraction efficiencies in the first order with two triangular gratings which is put along propagating direction of a beam produced by a conical lens-horn. (2). H-plane lateral width with power—3dB lapsed of the focus beam from a grating and a mirror in a grating spectrometer for millimeter waves (25–100 GHz).     

基团共轭效应研究Ⅱ：^13C核磁共振的化学位移与取代基的共轭效应强度

引言在定量和定性研究有机化合物的结构与性质的关系中,最广泛使用的是Hammett等所提出的σ_m、σ_p等取代基常数以及基团的诱导(场)效应和共轭效应常数。在建立基团的共轭效应常数方面,人们做了大量的工作,但多数工作是基于对基团的Hammett常数σ的人为分解上,建立的模型和分解方式(系数因子)不同,则得到不同的结果。另一方面纯理论计算工作大多引入较多参数,使计算复杂和使用不便。作者曾在建立表征诱导效应大小的     

Lanthanide Shift Reagents. Paper 18. Equilibrium Binding Constants for Europium Shift Reagent with Nitrogen Heterocycles

Paper 16 in this series^{1, 2, 3} was concerned with the equilibrium binding constants (K) of the shift reagent Europium tris (2, 2, 6, 6-tetramethylheptane-3, 5-dionate), Eu(thd)₃, with primary, secondary and tertiary amines. One nitrogen heterocycle, pyridine, and two of its derivatives (see Table) were included. In the present paper we describe the binding constants for a further 9 nitrogen containing heterocycles and relate these to basicity and steric effects.     

Linearization of nonlinear filter generators and its application to cryptanalysis of stream ciphers

Nonlinear filter generators are commonly used as keystream generators in stream ciphers. A nonlinear filter generator utilizes a nonlinear filtering function to combine the outputs of a linear feedback shift register (LFSR) to improve the linear complexity of keystream sequences. However, the LFSR-based stream ciphers are still potentially vulnerable to algebraic attacks that recover the key from some keystream bits. Although the known algebraic attacks only require polynomial time complexity of computations, all have their own constraints. This paper uses the linearization of nonlinear filter generators to cryptanalyze LFSR-based stream ciphers. Such a method works for any nonlinear filter generators. Viewing a nonlinear filter generator as a Boolean network that evolves as an automaton through Boolean functions, we first give its linearization representation. Compared to the linearization representation in Limniotis et al. (2008), this representation requires lower spatial complexity of computations in most cases. Based on the representation, the key recoverability is analyzed via the observability of Boolean networks. An algorithm for key recovery is given as well. Compared to the exhaustive search to recover the key, using this linearization representation requires lower time complexity of computations, though it leads to exponential time complexity.     

一种时序逻辑网络的快速设计方法

引用1984年尹克震提出的“开关函数的反演公式”,采用伪随机序列技术的思想,提出移位寄存器型时序逻辑网络的一种快速设计方法。     

一类描述混沌映射的符号动力系统

本文定义了符号空间上的拟移位映射,并用该类映射描述了Ｃａｎｔｏｒ集及平面Ｃａｎｔｏｒ集上的混沌映射,本文结果可看作Ｓｍａｌｅ马蹄模型的简化。     

Use of non-adiabatic geometric phase for quantum computing by NMR

Geometric phases have stimulated researchers for its potential applications in many areas of science. One of them is fault-tolerant quantum computation. A preliminary requisite of quantum computation is the implementation of controlled dynamics of qubits. In controlled dynamics, one qubit undergoes coherent evolution and acquires appropriate phase, depending on the state of other qubits. If the evolution is geometric, then the phase acquired depend only on the geometry of the path executed, and is robust against certain types of error. This phenomenon leads to an inherently fault-tolerant quantum computation. Here we suggest a technique of using non-adiabatic geometric phase for quantum computation, using selective excitation. In a two-qubit system, we selectively evolve a suitable subsystem where the control qubit is in state |1, through a closed circuit. By this evolution, the target qubit gains a phase controlled by the state of the control qubit. Using the non-adiabatic geometric phase we demonstrate implementation of Deutsch-Jozsa algorithm and Grover's search algorithm in a two-qubit system.